منابع مشابه
Low Complexity Multi Carrier Multiple Access with Cyclic Delay Diversity
In this paper, the performance of Discrete Fourier Transform (DFT) precoded Orthogonal Frequency Division Multiple Access (OFDMA) schemes with interleaved and with blockwise subcarrier allocation is investigated and compared. Transmission with one transmit antenna is compared to transmission with multiple transmit antennas using Cyclic Delay Diversity (CDD). It is shown that the investigated DF...
متن کاملCircuit Lower Bounds Collapse Relativized Complexity Classes
Since the publication of Furst, Saxe, and Sipser's seminal paper connecting AC 0 with the polynomial hierarchy FSS84], it has been well known that circuit lower bounds allow you to construct oracles that separate complexity classes. We will show that similar circuit lower bounds allow you to construct oracles that collapse complexity classes. For example, based on H astad's parity lower bound, ...
متن کاملOn the multi _ chi-square tests and their data complexity
Chi-square tests are generally used for distinguishing purposes; however when they are combined to simultaneously test several independent variables, extra notation is required. In this study, the chi-square statistics in some previous works is revealed to be computed half of its real value. Therefore, the notion of Multi _ Chi-square tests is formulated to avoid possible future confusions. In ...
متن کاملComplexity Of Minimum-Delay Gate Resizing
Gate resizing for minimum circuit delay is a fundamental problem in the performance optimization of gate-level circuits. In this paper , we study the complexity of two diierent minimum-delay gate resizing problems for combinational circuits composed of single-output gates. The rst problem is that of gate resizing for minimum circuit delay under the load-dependent delay model. The second problem...
متن کاملThe Computational Complexity of Delay Management
Delay management for public transport consists of deciding whether vehicles should wait for delayed transferring passengers, with the objective of minimizing the overall passenger discomfort. We model the underlying transportation network as a directed acyclic graph, where edges represent trains, and weighted paths represent passenger flows. Given initial delays of some of the passenger paths, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Research
سال: 2020
ISSN: 2643-1564
DOI: 10.1103/physrevresearch.2.033485